منابع مشابه
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals expected to have the best worst case resource availability. Prior research in value and variable ordering heuristics for scheduling problems indicated that sophisticated, but more costly measures of resource contentio...
متن کاملSymmetry in Scheduling Problems
The presence of symmetry is common in certain types of scheduling problems. Symmetry can occur when one is scheduling a collection of jobs on multiple identical machines, or if one is determining production schedules for identical machines. General symmetry-breaking methods can be strengthened by taking advantage of the special structure of the symmetry group in scheduling problems. In this pap...
متن کاملScheduling problems
We introduce the notion of a scheduling problem which is a boolean function S over atomic formulas of the form xi ≤ xj . Considering the xi as jobs to be performed, an integer assignment satisfying S schedules the jobs subject to the constraints of the atomic formulas. The scheduling counting function counts the number of solutions to S. We prove that this counting function is a polynomial in t...
متن کاملResolution Problems in Calculating Landscape Metrics
The variation of landscape metrics caused by varying the map input resolution has been investigated. Landscape metrics are spatial indicators used to link spatial patterns with the ecological processes that generate them. An aerial photograph was semiautomatically classified at different resolutions by superimposing a grid with a variable cell dimension (10, 20 and 40 metres) in a GIS environme...
متن کاملCourse Scheduling: Metrics, Models, and Methods
We consider the course scheduling problem when one is given lists of courses students would like to take, a section bound B, and a number of time slots T in which the courses can be scheduled. In this problem we must both assign students to sections of their selected courses, and build a timetable for the sections. This variant on timetabling problem has seen little previous work. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doklady Mathematics
سال: 2010
ISSN: 1064-5624,1531-8362
DOI: 10.1134/s1064562410030440